On Move Pattern Trends in a Large Go Games Corpus
نویسندگان
چکیده
We process a large corpus of game records of the board game of Go and propose a way of extracting summary information on played moves. We then apply several basic datamining methods on the summary information to identify the most differentiating features within the summary information, and discuss their correspondence with traditional Go knowledge. We show statistically significant mappings of the features to player attributes such as playing strength or informally perceived “playing style” (e.g. territoriality or aggressivity), describe accurate classifiers for these attributes, and propose applications including seeding real-work ranks of internet players, aiding in Go study and tuning of Go-playing programs, or contribution to Go-theoretical discussion on the scope of “playing style”.
منابع مشابه
THE GENERIC STRUCTURE OF ACKNOWLEDGMENTS IN PERSIAN DISSERTATIONS
Acknowledgments are vital since students/researchers can demonstrate their genuine appreciation through them and more importantly shape their (local/global) academic identity. In line with this significance, the present study examined the move patterns of 503 Persian dissertation acknowledgements from two major universities in Iran, from 1981 to 2014 and from sixteen various disciplines includi...
متن کاملMove Evaluation in Go Using Deep Convolutional Neural Networks
The game of Go is more challenging than other board games, due to the difficulty of constructing a position or move evaluation function. In this paper we investigate whether deep convolutional networks can be used to directly represent and learn this knowledge. We train a large 12-layer convolutional neural network by supervised learning from a database of human professional games. The network ...
متن کاملDynamic system of strategic games
Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...
متن کاملThe Move-Decision Strategy of Indigo
This paper describes the move decision strategy of Indigo. By using the example of Indigo, the paper shows that the move decision process of a Go program can be very different from the processes used in other games with lower complexity than the complexity of Go, even if the basic modules are conventional (move generator, evaluation function and tree search). Indigo uses them in a specific way,...
متن کاملBayesian Generation and Integration of K-nearest-neighbor Patterns for 19x19 Go
This paper describes the generation and utilisation of a pattern database for 19x19 go with the Knearest-neighbor representation. Patterns are generated by browsing recorded games of professional players. Meanwhile, their matching and playing probabilities are estimated. The database created is then integrated into an existing go program, INDIGO, either as an opening book or as an enrichment of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1209.5251 شماره
صفحات -
تاریخ انتشار 2012